Identifying similar network structures is key to capture graph isomorphisms and learn representations that exploit structural information encoded in graph data. This work shows that ego-networks can produce a structural encoding scheme for arbitrary graphs with greater expressivity than the Weisfeiler-Lehman (1-WL) test. We introduce IGEL, a preprocessing step to produce features that augment node representations by encoding ego-networks into sparse vectors that enrich Message Passing (MP) Graph Neural Networks (GNNs) beyond 1-WL expressivity. We describe formally the relation between IGEL and 1-WL, and characterize its expressive power and limitations. Experiments show that IGEL matches the empirical expressivity of state-of-the-art methods on isomorphism detection while improving performance on seven GNN architectures.
translated by 谷歌翻译
基于宽度的搜索方法在广泛的测试平台中显示了最先进的性能,从经典计划问题到基于图像的模拟器,例如Atari游戏。这些方法刻度独立于状态空间的大小,但在问题宽度中指数呈指数。在实践中,运行宽度大于1的算法是计算难以解决的,禁止IW解决更高的宽度问题。在本文中,我们介绍了一个分层算法,该算法在两个抽象级别中计划。高级计划者使用从低级修剪决策中逐步发现的抽象功能。我们在经典规划PDDL域中以及基于像素的模拟器域中说明了该算法。在古典规划中,我们展示了IW(1)在两个级别的抽象中如何解决宽度2的问题。对于基于像素的域,我们展示了如何结合学习的策略和学习价值函数,所提出的分层IW可以胜过目前具有稀疏奖励的Atari游戏的扁平IW策划者。
translated by 谷歌翻译
The development and adoption of artificial intelligence (AI) technologies in space applications is growing quickly as the consensus increases on the potential benefits introduced. As more and more aerospace engineers are becoming aware of new trends in AI, traditional approaches are revisited to consider the applications of emerging AI technologies. Already at the time of writing, the scope of AI-related activities across academia, the aerospace industry and space agencies is so wide that an in-depth review would not fit in these pages. In this chapter we focus instead on two main emerging trends we believe capture the most relevant and exciting activities in the field: differentiable intelligence and on-board machine learning. Differentiable intelligence, in a nutshell, refers to works making extensive use of automatic differentiation frameworks to learn the parameters of machine learning or related models. Onboard machine learning considers the problem of moving inference, as well as learning, onboard. Within these fields, we discuss a few selected projects originating from the European Space Agency's (ESA) Advanced Concepts Team (ACT), giving priority to advanced topics going beyond the transposition of established AI techniques and practices to the space domain.
translated by 谷歌翻译
Non-additive measures, also known as fuzzy measures, capacities, and monotonic games, are increasingly used in different fields. Applications have been built within computer science and artificial intelligence related to e.g. decision making, image processing, machine learning for both classification, and regression. Tools for measure identification have been built. In short, as non-additive measures are more general than additive ones (i.e., than probabilities), they have better modeling capabilities allowing to model situations and problems that cannot be modeled by the latter. See e.g. the application of non-additive measures and the Choquet integral to model both Ellsberg paradox and Allais paradox. Because of that, there is an increasing need to analyze non-additive measures. The need for distances and similarities to compare them is no exception. Some work has been done for defining $f$-divergence for them. In this work we tackle the problem of defining the optimal transport problem for non-additive measures. Distances for pairs of probability distributions based on the optimal transport are extremely used in practical applications, and they are being studied extensively for their mathematical properties. We consider that it is necessary to provide appropriate definitions with a similar flavour, and that generalize the standard ones, for non-additive measures. We provide definitions based on the M\"obius transform, but also based on the $(\max, +)$-transform that we consider that has some advantages. We will discuss in this paper the problems that arise to define the transport problem for non-additive measures, and discuss ways to solve them. In this paper we provide the definitions of the optimal transport problem, and prove some properties.
translated by 谷歌翻译
在本文中,我们介绍了一种新的离线方法,以使用演示(LFD)范式学习,在考虑用户对任务的直觉的同时,使用示范(LFD)范式学习,实现稳定性和性能约束,以找到可变阻抗控制的合适参数。考虑到从人类示范获得的合规性概况,给出了VIC的线性参数变化(LPV),它允许陈述设计问题,包括稳定性和性能约束为线性矩阵不平等(LMIS)。因此,使用解决方案搜索方法,我们根据用户偏好在任务行为上找到最佳解决方案。通过比较获得的控制器的执行与在二维轨迹跟踪任务中不同用户首选项集的设计的解决方案来验证设计问题。将滑轮循环任务作为案例研究提出,以评估可变阻抗控制器的性能,并使用用户偏好机制对恒定的稳定性控制器进行恒定的敏捷性和倾斜度。所有实验均使用7-DOF Kinova Gen3操纵器进行。
translated by 谷歌翻译
在复杂,非结构化和动态环境中导航的董事会机器人基于在线事件的感知技术可能会遭受进入事件速率及其处理时间的不可预测的变化,这可能会导致计算溢出或响应能力损失。本文提出了尽快的:一种新型的事件处理框架,该框架将事件传输到处理算法,保持系统响应能力并防止溢出。尽快由两种自适应机制组成。第一个通过丢弃传入事件的自适应百分比来防止事件处理溢出。第二种机制动态调整事件软件包的大小,以减少事件生成和处理之间的延迟。ASAP保证了收敛性,并且对处理算法具有灵活性。它已在具有挑战性的条件下在船上进行了验证。
translated by 谷歌翻译
事件摄像机可以通过非常高的时间分辨率和动态范围来捕获像素级照明变化。由于对照明条件和运动模糊的稳健性,他们获得了越来越多的研究兴趣。文献中存在两种主要方法,用于喂养基于事件的处理算法:在事件软件包中包装触发的事件并将它们逐一发送作为单个事件。这些方法因处理溢出或缺乏响应性而受到限制。当算法无法实时处理所有事件时,处理溢出是由高事件产生速率引起的。相反,当事件包的频率太低时,事件包的生成率低时,缺乏响应率会发生。本文提出了尽快的自适应方案,该方案是通过可容纳事件软件包处理时间的可变大小软件包来管理事件流的。实验结果表明,ASAP能够以响应性和有效的方式喂食异步事件聚类算法,同时又可以防止溢出。
translated by 谷歌翻译
基于模糊规则的系统(FRBS)是一个基于规则的系统,它使用语言模糊变量作为前身,因此代表人类可理解的知识。它们已应用于整个文献的各种应用和领域。但是,FRBS遭受了许多缺点,例如不确定性表示,大量规则,解释性损失,学习时间高的计算时间等,以克服FRBS的这些问题,存在许多范围的FRBS。在本文中,我们介绍了模糊系统(FRBS)的各种类型和突出领域的概述和文献综述,即遗传模糊系统(GFS),层次结构模糊系统(HFS),Neuro Fuzzy System(NFS),不断发展的模糊系统(EFS)(EFS)(EFS) ),在2010 - 2021年期间,用于大数据的FRBS,用于数据不平衡数据的FRBS,用于不平衡数据的FRBS,用于使用集群质心作为模糊规则的FRB和FRBS。 GFS使用遗传/进化方法来提高FRBS的学习能力,HFS解决了FRBS的尺寸诅咒,NFS在EFS中考虑使用神经网络和动态系统来提高FRBS的近似能力,并且在EFS中考虑了动态系统。 FRBs被视为大数据和不平衡数据的好解决方案,近年来,由于高维度和大数据和规则,使用集群质心来限制FRBS中的规则数量,因此FRBS的可解释性已受欢迎。本文还强调了该领域的重要贡献,出版统计和当前趋势。该论文还涉及几个需要从FRBS研究社区进一步关注的开放研究领域。
translated by 谷歌翻译
长期以来,部署能够探索未知环境的自动驾驶机器人一直是与机器人社区有很大相关性的话题。在这项工作中,我们通过展示一个开源的活动视觉猛烈框架来朝着这个方向迈出一步基础姿势图提供的结构。通过仔细估计后验加权姿势图,在线实现了D-最佳决策,目的是在发生探索时改善本地化和映射不确定性。
translated by 谷歌翻译
深度神经网络(DNNS)已成为现代软件系统的关键组成部分,但是在与训练期间观察到的条件不同的条件下,它们很容易失败,或者对真正模棱两可的输入,即。 ,在其地面真实标签中接受多个类别的多个类别的输入。最近的工作提出了DNN主管在可能的错误分类之前检测高确定性输入会导致任何伤害。为了测试和比较DNN主管的能力,研究人员提出了测试生成技术,将测试工作集中在高度确定性输入上,这些输入应被主管识别为异常。但是,现有的测试发电机只能产生分布式输入。没有现有的模型和主管与无关的技术支持真正模棱两可的测试输入。在本文中,我们提出了一种新的方法来生成模棱两可的输入来测试DNN主管,并将其用于比较几种现有的主管技术。特别是,我们建议歧义生成图像分类问题的模棱两可的样本。模棱两可的基于正规化对抗自动编码器的潜在空间中的梯度引导采样。此外,据我们所知,我们进行了最广泛的DNN主管比较研究,考虑到它们可以检测到4种不同类型的高级输入(包括真正模棱两可的)的能力。
translated by 谷歌翻译